A measure of graph vulnerability: scattering number
نویسندگان
چکیده
منابع مشابه
A Measure of Graph Vulnerability: Scattering Number
The scattering number of a graph G, denoted sc(G), is defined by sc(G)=max{c(G−S)− |S| : S ⊆ V(G) and c(G−S)≠ 1} where c(G−S) denotes the number of components in G− S. It is one measure of graph vulnerability. In this paper, general results on the scattering number of a graph are considered. Firstly, some bounds on the scattering number are given. Further, scattering number of a binomial tree i...
متن کاملTowards a measure of vulnerability, tenacity of a Graph
If we think of the graph as modeling a network, the vulnerability measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including connectivity, integrity, toughness, binding number and tenacity.In this paper we discuss...
متن کاملtowards a measure of vulnerability, tenacity of a graph
if we think of the graph as modeling a network, the vulnerability measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. many graph theoretical parameters have been used to describe the vulnerability of communication networks, including connectivity, integrity, toughness, binding number and tenacity.in this paper we discuss...
متن کاملVulnerability Measure of a Network - a Survey
In this paper we discuss about tenacity and its properties in stability calculation. We indicate relationships between tenacity and connectivity, tenacity and binding number, tenacity and toughness. We also give good lower and upper bounds for tenacity. Since we are primarily interested in the case where disruption of the graph is caused by the removal of a vertex or vertices (and the resulting...
متن کاملUniform Number of a Graph
We introduce the notion of uniform number of a graph. The uniform number of a connected graph $G$ is the least cardinality of a nonempty subset $M$ of the vertex set of $G$ for which the function $f_M: M^crightarrow mathcal{P}(X) - {emptyset}$ defined as $f_M(x) = {D(x, y): y in M}$ is a constant function, where $D(x, y)$ is the detour distance between $x$ and $y$ in $G$ and $mathcal{P}(X)$ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 2002
ISSN: 0161-1712,1687-0425
DOI: 10.1155/s0161171202012607